Density of Chromatic Roots in Minor-Closed Graph Families
نویسندگان
چکیده
منابع مشابه
Chromatic Roots and Minor-Closed Families of Graphs
Given a minor-closed class of graphs G, what is the infimum of the non-trivial roots of the chromatic polynomial of G ∈ G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minorclosed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.
متن کاملSquare Roots of Minor Closed Graph Classes
Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.
متن کاملDensities of Minor-Closed Graph Families
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities. This set of numbers is countable, well-ordered, and closed; its order type is at least ωω. It is the closure of the set of densities of density-minimal graphs...
متن کاملList-chromatic Number and the Chromatic Number in Minor-closed and Odd-minor-closed Classes of Graphs
It is well-known (Feige and Kilian [24], H̊astad [39]) that approximating the chromatic number within a factor of n1−ε cannot be done in polynomial time for ε > 0, unless coRP = NP. Computing the list-chromatic number is much harder than determining the chromatic number. It is known that the problem of deciding if the list-chromatic number is k, where k ≥ 3, is Πp2-complete [37]. In this paper, ...
متن کاملPacking minor closed families of graphs
Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection T1, . . . , Tn of trees on n vertices with ∑n i=1 e(Ti) ≤ ( n 2 ) and with bounded maximum degree, can be packed into the complete graph on (1 + o(1))n vertices. We generalize this result where we relax the restriction of packing families of trees to families of graphs of any given no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548318000184